Vulnerability issues of star graphs, alternating group graphs and split-stars: strength and toughness
نویسندگان
چکیده
منابع مشابه
Vulnerability issues of star graphs, alternating group graphs and split-stars: strength and toughness
Akers et al. (Proceedings of the International Conference on Parallel Processing, 1987, pp. 393–400) proposed an interconnection topology, the star graph, as an alternative to the popular n-cube. Jwo et al. (Networks 23 (1993) 315–326) studied the alternating group graph An. Cheng et al. (Super connectivity of star graphs, alternating group graphs and split-stars, Ars Combin. 59 (2001) 107–116)...
متن کاملcommuting and non -commuting graphs of finit groups
فرض کنیمg یک گروه غیر آبلی متناهی باشد . گراف جابجایی g که با نماد نمایش داده می شود ،گرافی است ساده با مجموعه رئوس که در آن دو راس با یک یال به هم وصل می شوند اگر و تنها اگر . مکمل گراف جابجایی g راگراف نا جابجایی g می نامیم.و با نماد نشان می دهیم. گرافهای جابجایی و ناجابجایی یک گروه متناهی ،اولین بار توسطاردوش1 مطرح گردید ،ولی در سالهای اخیر به طور مفصل در مورد بحث و بررسی قرار گرفتند . در ،م...
15 صفحه اولNormalized Tenacity and Normalized Toughness of Graphs
In this paper, we introduce the novel parameters indicating Normalized Tenacity ($T_N$) and Normalized Toughness ($t_N$) by a modification on existing Tenacity and Toughness parameters. Using these new parameters enables the graphs with different orders be comparable with each other regarding their vulnerabilities. These parameters are reviewed and discussed for some special graphs as well.
متن کاملThe spectrum of the hyper-star graphs and their line graphs
Let n 1 be an integer. The hypercube Qn is the graph whose vertex set isf0;1gn, where two n-tuples are adjacent if they differ in precisely one coordinate. This graph has many applications in Computer sciences and other area of sciences. Inthe graph Qn, the layer Lk is the set of vertices with exactly k 1’s, namely, vertices ofweight k, 1 k n. The hyper-star graph B(n;k) is...
متن کاملUni-directional Alternating Group Graphs
A class of uni-directional Cayley graphs based on alternating groups is proposed in this paper. It is shown that this class of graphs is strongly connected and recursively scalable. The analysis of the shortest distance between any pair of nodes in a graph of this class is also given. Based on the analysis, we develop a polynomial time routing algorithm which yields a path distance at most one ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2002
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(01)00234-7